TSTP Solution File: NUM751^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM751^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 11:55:02 EDT 2022
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 26 unt; 7 typ; 0 def)
% Number of atoms : 192 ( 51 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 338 ( 31 ~; 43 |; 0 &; 256 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 0 ^ 93 !; 0 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_frac,type,
frac: $tType ).
thf(tp_eq,type,
eq: frac > frac > $o ).
thf(tp_moref,type,
moref: frac > frac > $o ).
thf(tp_pf,type,
pf: frac > frac > frac ).
thf(tp_x,type,
x: frac ).
thf(tp_y,type,
y: frac ).
thf(tp_z,type,
z: frac ).
thf(1,axiom,
! [Xx: frac,Xy: frac] : ( eq @ ( pf @ Xx @ Xy ) @ ( pf @ Xy @ Xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz58) ).
thf(2,axiom,
! [Xx: frac,Xy: frac,Xz: frac] :
( ( moref @ Xx @ Xy )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62a) ).
thf(3,axiom,
! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( moref @ Xx @ Xy )
=> ( ( eq @ Xx @ Xz )
=> ( ( eq @ Xy @ Xu )
=> ( moref @ Xz @ Xu ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz44) ).
thf(4,axiom,
moref @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(5,conjecture,
moref @ ( pf @ z @ x ) @ ( pf @ z @ y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62d) ).
thf(6,negated_conjecture,
( ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $false ),
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $false ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [Xx: frac,Xy: frac] : ( eq @ ( pf @ Xx @ Xy ) @ ( pf @ Xy @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(9,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac] :
( ( moref @ Xx @ Xy )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(10,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( moref @ Xx @ Xy )
=> ( ( eq @ Xx @ Xz )
=> ( ( eq @ Xy @ Xu )
=> ( moref @ Xz @ Xu ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(11,plain,
( ( moref @ x @ y )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(12,plain,
( ( ~ ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(13,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( moref @ Xx @ Xy )
| ! [Xz: frac] : ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(14,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( moref @ Xx @ Xy )
| ! [Xz: frac] :
( ~ ( eq @ Xx @ Xz )
| ! [Xu: frac] :
( ~ ( eq @ Xy @ Xu )
| ( moref @ Xz @ Xu ) ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(15,plain,
( ( moref @ x @ y )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(16,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( moref @ Xx @ Xy )
| ! [Xz: frac] :
( ~ ( eq @ Xx @ Xz )
| ! [Xu: frac] :
( ~ ( eq @ Xy @ Xu )
| ( moref @ Xz @ Xu ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(17,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( moref @ Xx @ Xy )
| ! [Xz: frac] : ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xz ) ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(18,plain,
( ( ! [Xx: frac,Xy: frac] : ( eq @ ( pf @ Xx @ Xy ) @ ( pf @ Xy @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(19,plain,
( ( ~ ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(20,plain,
! [SV1: frac] :
( ( ! [SY9: frac] :
( ~ ( moref @ SV1 @ SY9 )
| ! [SY10: frac] :
( ~ ( eq @ SV1 @ SY10 )
| ! [Xu: frac] :
( ~ ( eq @ SY9 @ Xu )
| ( moref @ SY10 @ Xu ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(21,plain,
! [SV2: frac] :
( ( ! [SY12: frac] :
( ~ ( moref @ SV2 @ SY12 )
| ! [SY13: frac] : ( moref @ ( pf @ SV2 @ SY13 ) @ ( pf @ SY12 @ SY13 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(22,plain,
! [SV3: frac] :
( ( ! [SY14: frac] : ( eq @ ( pf @ SV3 @ SY14 ) @ ( pf @ SY14 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(23,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ z @ y ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(24,plain,
! [SV4: frac,SV1: frac] :
( ( ~ ( moref @ SV1 @ SV4 )
| ! [SY15: frac] :
( ~ ( eq @ SV1 @ SY15 )
| ! [SY16: frac] :
( ~ ( eq @ SV4 @ SY16 )
| ( moref @ SY15 @ SY16 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV5: frac,SV2: frac] :
( ( ~ ( moref @ SV2 @ SV5 )
| ! [SY17: frac] : ( moref @ ( pf @ SV2 @ SY17 ) @ ( pf @ SV5 @ SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(26,plain,
! [SV6: frac,SV3: frac] :
( ( eq @ ( pf @ SV3 @ SV6 ) @ ( pf @ SV6 @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(27,plain,
! [SV4: frac,SV1: frac] :
( ( ( ~ ( moref @ SV1 @ SV4 ) )
= $true )
| ( ( ! [SY15: frac] :
( ~ ( eq @ SV1 @ SY15 )
| ! [SY16: frac] :
( ~ ( eq @ SV4 @ SY16 )
| ( moref @ SY15 @ SY16 ) ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[24]) ).
thf(28,plain,
! [SV5: frac,SV2: frac] :
( ( ( ~ ( moref @ SV2 @ SV5 ) )
= $true )
| ( ( ! [SY17: frac] : ( moref @ ( pf @ SV2 @ SY17 ) @ ( pf @ SV5 @ SY17 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(29,plain,
! [SV4: frac,SV1: frac] :
( ( ( moref @ SV1 @ SV4 )
= $false )
| ( ( ! [SY15: frac] :
( ~ ( eq @ SV1 @ SY15 )
| ! [SY16: frac] :
( ~ ( eq @ SV4 @ SY16 )
| ( moref @ SY15 @ SY16 ) ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(30,plain,
! [SV5: frac,SV2: frac] :
( ( ( moref @ SV2 @ SV5 )
= $false )
| ( ( ! [SY17: frac] : ( moref @ ( pf @ SV2 @ SY17 ) @ ( pf @ SV5 @ SY17 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(31,plain,
! [SV4: frac,SV7: frac,SV1: frac] :
( ( ( ~ ( eq @ SV1 @ SV7 )
| ! [SY18: frac] :
( ~ ( eq @ SV4 @ SY18 )
| ( moref @ SV7 @ SY18 ) ) )
= $true )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(32,plain,
! [SV5: frac,SV8: frac,SV2: frac] :
( ( ( moref @ ( pf @ SV2 @ SV8 ) @ ( pf @ SV5 @ SV8 ) )
= $true )
| ( ( moref @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(33,plain,
! [SV4: frac,SV7: frac,SV1: frac] :
( ( ( ~ ( eq @ SV1 @ SV7 ) )
= $true )
| ( ( ! [SY18: frac] :
( ~ ( eq @ SV4 @ SY18 )
| ( moref @ SV7 @ SY18 ) ) )
= $true )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(34,plain,
! [SV4: frac,SV7: frac,SV1: frac] :
( ( ( eq @ SV1 @ SV7 )
= $false )
| ( ( ! [SY18: frac] :
( ~ ( eq @ SV4 @ SY18 )
| ( moref @ SV7 @ SY18 ) ) )
= $true )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV1: frac,SV7: frac,SV9: frac,SV4: frac] :
( ( ( ~ ( eq @ SV4 @ SV9 )
| ( moref @ SV7 @ SV9 ) )
= $true )
| ( ( eq @ SV1 @ SV7 )
= $false )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(36,plain,
! [SV1: frac,SV7: frac,SV9: frac,SV4: frac] :
( ( ( ~ ( eq @ SV4 @ SV9 ) )
= $true )
| ( ( moref @ SV7 @ SV9 )
= $true )
| ( ( eq @ SV1 @ SV7 )
= $false )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(37,plain,
! [SV1: frac,SV7: frac,SV9: frac,SV4: frac] :
( ( ( eq @ SV4 @ SV9 )
= $false )
| ( ( moref @ SV7 @ SV9 )
= $true )
| ( ( eq @ SV1 @ SV7 )
= $false )
| ( ( moref @ SV1 @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(38,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,37,32,26,23]) ).
thf(39,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM751^1 : TPTP v8.1.0. Released v3.7.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jul 6 11:32:29 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35
% 0.14/0.35 No.of.Axioms: 4
% 0.14/0.35
% 0.14/0.35 Length.of.Defs: 0
% 0.14/0.35
% 0.14/0.35 Contains.Choice.Funs: false
% 0.14/0.35 (rf:0,axioms:4,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:6,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.14/0.39
% 0.14/0.39 ********************************
% 0.14/0.39 * All subproblems solved! *
% 0.14/0.39 ********************************
% 0.14/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.14/0.39
% 0.14/0.39 %**** Beginning of derivation protocol ****
% 0.14/0.39 % SZS output start CNFRefutation
% See solution above
% 0.14/0.39
% 0.14/0.39 %**** End of derivation protocol ****
% 0.14/0.39 %**** no. of clauses in derivation: 39 ****
% 0.14/0.39 %**** clause counter: 38 ****
% 0.14/0.39
% 0.14/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:4,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:38,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------